1.This article gives a necessary and sufficient condition to decide a transitive binary relation, and an algorithm to realize by computer.
本文给出了判断可传递二元关系的一个充要条件，以及在计算机上实现的具体算法。
2.Semantic association is defined as the representation of rich knowledge about binary relation in semantic data model .
语义关联是语义数据模型中实体之间二维关系的知识表示形式。
3.Analyzed an illustrative example to indicate the validity of the new-defined binary relation.
对一不完备信息系统进行了实例分析，以说明新提出的二元关系的有效性。
4.The set E may be thought of as a binary relation on set V.
集合E可看成集合V上的一个二元关系。
5.The judgment of transitive binary relation is a difficult point ind discrete mathematic.
可传递二元关系的判定是离散数学中的一个难点。
6.The results provides theory basis for knowledge acquisition of information systems and decision table based on general binary relation.
所得结果为在一般二元关系下的信息和决策表的知识获取提供了理论依据。
7.A new proof of the necessary and sufficient condition for a binary relation was of transitivity
二元关系具备传递性的充要条件的一种新的证明
8.On Transitivity and Transitive Closure for Binary Relation
二元关系的传递性和传递闭包探讨
9.Some Properties of Operation to Binary Relation Closure
论二元关系闭包的一些运算性质
10.Properties and judgment of binary relation
二元关系的性质及判定